Absolutely saturated models

On Bounding Saturated Models

A degree is saturated bounding if it can compute a saturated model for any complete, decidable theory whose types are all computable. All high and PA degrees are saturated bounding (following from results of Jockusch and MacIntyre-Marker.) We show that for every n, no lown c.e. degree is saturated bounding, extending the previous known result that 0 is not saturated bounding, by Millar.

Saturated models in institutions

the date of receipt and acceptance should be inserted later Keywords Saturated models · institutions · institution-independent model theory Abstract Saturated models constitute one of the powerful methods of conventional model theory, with many applications. Here we develop a categorical abstract model theoretic approach to saturated models within the theory of institutions. The most important ...

Saturated models of universal theories

A notion called Herbrand saturation is shown to provide the modeltheoretic analogue of a proof-theoretic method, Herbrand analysis, yielding uniform model-theoretic proofs of a number of important conservation theorems. A constructive, algebraic variation of the method is described, providing yet a third approach, which is finitary but retains the semantic flavor of the model-theoretic version.

Reverse Mathematics of Saturated Models

Degrees of Recursively Saturated Models

Using relativizations of results of Goncharov and Peretyat'kin on decidable homogeneous models, we prove that if M is S-saturated for some Scott set S, and F is an enumeration of S, then M has a presentation recursive in F. Applying this result we are able to classify degrees coding (i) the reducts of models of PA to addition or multiplication, (ii) internally finite initial segments and (iii) ...